Balanced Subdivisions with Boundary Condition of Two Sets of Points in the Plane

Let R and B be two disjoint sets of red points and blue points in the plane, respectively, such that no three points of R ∪ B are collinear, and let a, b and g be positive integers. We show that if ag ≤ |R| < (a + 1)g and bg ≤ |B| < (b + 1)g, then we can subdivide the plane into g convex polygons so that every open convex polygon contains exactly a red points and b blue points and that the remaining points lie on the boundary of the subdivision. This is a generalization of equitable subdivision of ag red points and bg blue points in the plane.